Affinity Properties of Truss Model Nodes
نویسنده
چکیده
Strut and tie models consist of axial force members which react on one another and on external supports through nodes, i.e. they are trusses. An analysis of a truss problem is normally entered by reducing it to a line diagram of member centrelines representing the lines along which the stress resultants in the members are intended to act. When forces are concentrated in a line diagram the nodes vanish and become points thus ensuring that member forces are concurrent and that moment equilibrium is satisfied at the nodes and this simplifies the problem to one which produces a tractable model. When fleshing out the results of a truss analysis in order to size members in structural design we use the line diagram to locate the centroidal axes of members, implicitly assuming that it is necessary to maintain the concurrence of axial forces in order to ensure moment equilibrium of nodes. For strut and tie models each node must be detailed so that it is capable of transferring the forces between members. The finite widths of the members generate a common area which is satisfactory as a real node for three force cases but not necessarily for multi-force cases in which case complex nodes have been proposed [1] [2]. We will show that there is a node model in which member forces are not concurrent but moment equilibrium is automatically satisfied in which tithe shape of the boundary is affine to the polygon of forces for the members meeting at the joint. Marti noted to the author [3] that the affinity property presented in this paper is a general statement about properties that he had used in some of his solutions [4], [5].
منابع مشابه
Attribute Truss Community Search
Recently, community search over graphs has attracted significant attention and many algorithms have been developed for finding dense subgraphs from large graphs that contain given query nodes. In applications such as analysis of protein protein interaction (PPI) networks, citation graphs, and collaboration networks, nodes tend to have attributes. Unfortunately, most previously developed communi...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملApproximate Closest Community Search in Networks
Recently, there has been significant interest in the study of the community search problem in social and information networks: given one or more query nodes, find densely connected communities containing the query nodes. However, most existing studies do not address the “free rider” issue, that is, nodes far away from query nodes and irrelevant to them are included in the detected community. So...
متن کاملShear-friction truss model for reinforced concrete beams
This paper presents a new model, called the "shear-friction truss model," for slender reinforced concrete beams to derive a clear and simple design equation for their ultimate shear strength. In this model, a portion of the shear strength is provided by shear reinforcement as in the traditional truss model, and the remainder by the shear-friction mechanism. Friction resistance is derived consid...
متن کاملCompatibility Conditions for Discrete Elastic Structures
The theory of plane, elastic trusses is reconsidered from the viewpoint of the continuum theory of elastic media. A main difference between continuum and discrete theories is the following: In the continuous case all quantities are declared throughout the whole body, whereas in the discrete case each quantity has its own “carrier”. In a truss, for instance, displacements and applied forces are ...
متن کامل